The Capacity of Private Information Retrieval from Decentralized Uncoded Caching Databases
نویسندگان
چکیده
منابع مشابه
Private Information Retrieval from Storage Constrained Databases - Coded Caching meets PIR
Private information retrieval (PIR) allows a user to retrieve a desired message out of K possible messages from N databases without revealing the identity of the desired message. There has been significant recent progress on understanding fundamental information theoretic limits of PIR, and in particular the download cost of PIR for several variations. Majority of existing works however, assume...
متن کاملCache-Aided Private Information Retrieval with Partially Known Uncoded Prefetching
We consider the problem of private information retrieval (PIR) from N non-colluding and replicated databases, when the user is equipped with a cache that holds an uncoded fraction r from each of the K stored messages in the databases. This model operates in a two-phase scheme, namely, the prefetching phase where the user acquires side information and the retrieval phase where the user privately...
متن کاملThe Capacity of Private Information Retrieval with Private Side Information
The problem of private information retrieval with private side information (PIR-PSI) is recently introduced by Kadhe et al. In this problem, N replicated databases each store K messages, of which M are known to the user as side-information. The identity of these M messages is unknown to the databases. The user wishes to retrieve, as efficiently as possible, a new desired message without reveali...
متن کاملThe Capacity of Private Information Retrieval from Byzantine and Colluding Databases
We consider the problem of single-round private information retrieval (PIR) from N replicated databases. We consider the case when B databases are outdated (unsynchronized), or even worse, adversarial (Byzantine), and therefore, can return incorrect answers. In the PIR problem with Byzantine databases (BPIR), a user wishes to retrieve a specific message from a set of M messages with zero-error,...
متن کاملH(k)-private Information Retrieval from Privacy-uncooperative Queryable Databases.">h(k)-private Information Retrieval from Privacy-uncooperative Queryable Databases
Purpose – This paper aims to address the privacy problem associated with the use of internet search engines. The purpose of the paper is to propose and validate a set of methods and protocols to guarantee the privacy of users’ queries. Design/methodology/approach – In this paper h(k)-private information retrieval (h(k)-PIR) is defined as a practical compromise between computational efficiency a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information
سال: 2019
ISSN: 2078-2489
DOI: 10.3390/info10120372